A situation in which a finite set of players can obtain certain grey payoffs by cooperation can be described by a cooperative grey game. In this paper, we consider some grey division rules, called the grey equal surplus sharing solutions. Further, we focus on a class of the grey equal surplus sharing solutions consisting of all convex combinations of these solutions. Finally, an application of Operations Research (OR) situations is given.